Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
نویسندگان
چکیده
A basic question in Virtual Private Network (VPN) design is if the symmetric version of the problem always has an optimal solution which is a tree network. An affirmative answer would imply that the symmetric VPN problem is solvable in polynomial time. We give an affirmative answer in case the communication network within which to create the VPN is a circuit. This seems to be an important step towards an answer to the general question. The proof relies on a dual pair of linear programs and actually implies an even stronger property of VPNs. We show that this property also holds for some other special cases of the problem.
منابع مشابه
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all terminals form a tree. Only recently, Hurkens, Keijsper, and Stougie gave a proof of this conjecture for the special case of ring networks. Their proof is based on a dual pair of linear programs and is somewhat involved. ...
متن کاملar X iv : 0 71 1 . 26 23 v 1 [ m at h . O C ] 16 N ov 2 00 7 THE VIRTUAL PRIVATE NETWORK DESIGN TREE ROUTING CONJECTURE FOR OUTERPLANAR NETWORKS
The VPN Tree Routing Conjecture is a conjecture about the Virtual Private Network Design problem. It states that the symmetric version of the problem always has an optimum solution which has a tree-like structure. In recent work, Hurkens, Keijsper and Stougie (Proc. IPCO XI, 2005; SIAM J. Discrete Math., 2007) have shown that the conjecture holds when the network is a ring. A shorter proof of t...
متن کاملar X iv : 0 71 1 . 26 23 v 3 [ m at h . O C ] 2 4 N ov 2 00 8 THE VPN TREE ROUTING CONJECTURE FOR OUTERPLANAR NETWORKS
The VPN Tree Routing Conjecture is a conjecture about the Virtual Private Network Design problem. It states that the symmetric version of the problem always has an optimum solution which has a tree-like structure. In recent work, Hurkens, Keijsper and Stougie (Proc. IPCO XI, 2005; SIAM J. Discrete Math., 2007) have shown that the conjecture holds when the network is a ring. A shorter proof of t...
متن کاملRobust Network Design
Robust network design takes the very successful framework of robust optimization and applies it to the area of network design, motivated by applications in communication networks. The main premise is that demands across the network are not fixed, but are variable or uncertain. However, they are known to fall within a prescribed uncertainty set. Our solution must have sufficient capacity to rout...
متن کاملThe Virtual Private Network Design Problem with Concave Costs
The symmetric Virtual Private Network Design (VPND) problem is concerned with buying capacity on links (edges) in a communication network such that certain traffic demands can be met. The precise definition is below. It was shown by Fingerhut, Suri and Turner [3] and later, independently, by Gupta, Kleinberg, Kumar, Rastogi and Yener [8] that VPND can be solved in polynomial time if it has the ...
متن کامل